public class  SortArrayTwo{
    int[] tmp;

    public int[] code(int[] nums) {
        tmp = new int[nums.length];
        mergeSort(nums, 0, nums.length - 1);
        return nums;
    }

    public void mergeSort(int[] nums, int left, int right){
        if (left >= right){
            return;
        }

        int mid = (left + right) / 2;

        mergeSort(nums, left, mid);
        mergeSort(nums, mid + 1, right);

        int cur1 = left, cur2 = mid + 1, i = 0;
        while (cur1 <= mid && cur2 <= right){
            tmp[i++] = nums[cur1] <= nums[cur2] ? nums[cur1++] : nums[cur2++];
        }

        while (cur1 <= mid){
            tmp[i++] = nums[cur1++];
        }

        while (cur2 <= right){
            tmp[i++] = nums[cur2++];
        }

        for (int j = left; j <= right; j++){
            nums[j] = tmp[j - left];
        }
    }

    public static void main(String[] args) {

    }
}
